Crossing and Alignments of Permutations
نویسنده
چکیده
We derive the continued fraction form of the generating function of some new q-analogs of the Eulerian numbers Êk,n(q) introduced by Lauren Williams building on work of Alexander Postnikov. They are related to the number of alignments and weak exceedances of permutations. We show how these numbers are related to crossing and generalized patterns of permutations We generalize to the case of decorated permutations. Finally we show how these numbers appear naturally in the stationary distribution of the ASEP model.
منابع مشابه
On the complexity of crossings in permutations
We investigate crossing minimization problems for a set of permutations, where a crossing expresses a disarrangement between elements. The goal is a common permutation π∗ which minimizes the number of crossings. In voting and social science theory this is known as the Kemeny optimal aggregation problem minimizing the Kendall-τ distance. This rank aggregation problem can be phrased as a one-side...
متن کاملOn k-crossings and k-nestings of permutations
We introduce k-crossings and k-nestings of permutations. We show that the crossing number and the nesting number of permutations have a symmetric joint distribution. As a corollary, the number of k-noncrossing permutations is equal to the number of k-nonnesting permutations. We also provide some enumerative results for k-noncrossing permutations for some values of k. Résumé. Nous introduisons l...
متن کاملSymmetric Distribution of Crossings and Nestings in Permutations of Type B
This note contains two results on the distribution of crossing numbers and nesting numbers in permutations of type B. More precisely, we prove a Bn-analogue of the symmetric distribution of crossings and nestings of permutations due to Corteel [Adv. Appl. Math. 38(2)(2007), 149–163] as well as the symmetric distribution of k-crossings and k-nestings of permutations due to Burrill et al. [DMTCS ...
متن کاملExpansions of a Chord Diagram and Alternating Permutations
A chord diagram is a set of chords of a circle such that no pair of chords has a common endvertex. A chord diagram E with n chords is called an n-crossing if all chords of E are mutually crossing. A chord diagram E is called nonintersecting if E contains no 2-crossing. For a chord diagram E having a 2-crossing S = {x1x3, x2x4}, the expansion of E with respect to S is to replace E with E1 = (E\S...
متن کاملOPAAS: a web server for optimal, permuted, and other alternative alignments of protein structures
The large number of experimentally determined protein 3D structures is a rich resource for studying protein function and evolution, and protein structure comparison (PSC) is a key method for such studies. When comparing two protein structures, almost all currently available PSC servers report a single and sequential (i.e. topological) alignment, whereas the existence of good alternative alignme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005